EULER–LAGRANGE CORRESPONDENCE OF GENERALIZED BURGERS CELLULAR AUTOMATON
نویسندگان
چکیده
منابع مشابه
Two-dimensional Burgers Cellular Automaton
In this paper, a two-dimensional cellular automaton(CA) associated with a two-dimensional Burgers equation is presented. The 2D Burgers equation is an integrable generalization of the well-known Burgers equation, and is transformed into a 2D diffusion equation by the Cole-Hopf transformation. The CA is derived from the 2D Burgers equation by using the ultradiscrete method, which can transform d...
متن کاملA Cellular Automaton for Burgers' Equation
A bstract. We study the app roximation of solut ions to the Burgers' equation , an + c!.-(n _n 2) = v a 2 n ilt ilx 2 ilx' (1) by spatially avera ging a prob abilistic cellular automaton motivated by random walks on a line. The auto maton consists of moving "particles" on Q. one-dimensional periodic lattice with spe ed one and in a random direction subject to the exclusion principle that at mos...
متن کاملHeat Polynomials, Umbral Correspondence and Burgers Equations.
We show that the umbral correspondence between differential equations can be achieved by means of a suitable transformation preserving the algebraic structure of the problems. We present the general properties of these transformations, derive explicit examples and discuss them in the case of the Appèl and Sheffer polynomial families. We apply these transformations to non-linear equations, and d...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملA Particular Universal Cellular Automaton
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of colliding signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2004
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183104005917